Some properties of 3-domination-critical graphs
نویسندگان
چکیده
منابع مشابه
Hamilton-Connectivity of 3-Domination Critical Graphs
A graph G is 3-domination critical if its domination number γ is 3 and the addition of any edge decreases γ by 1. Let G be a 3-domination critical graph with toughness more than one. It was proved G is Hamiltonconnected for the cases α ≤ δ (Discrete Mathematics 271 (2003) 1-12) and α = δ + 2 (European Journal of Combinatorics 23(2002) 777-784). In this paper, we show G is Hamilton-connected for...
متن کاملCritical properties on Roman domination graphs
A Roman domination function on a graph G is a function r : V (G) → {0, 1, 2} satisfying the condition that every vertex u for which f(u) = 0 is adjacent to at least one vertex v for which f(v) = 2. The weight of a Roman function is the value r(V (G)) = ∑ u∈V (G) r(u). The Roman domination number γR(G) of G is the minimum weight of a Roman domination function on G . "Roman Criticality" has been ...
متن کاملMatching properties in connected domination critical graphs
A dominating set of vertices S of a graph G is connected if the subgraph G[S] is connected. Let c(G) denote the size of any smallest connected dominating set in G. A graph G is k-connected-critical if c(G)= k, but if any edge e ∈ E(Ḡ) is added to G, then c(G+ e) k − 1. This is a variation on the earlier concept of criticality of edge addition with respect to ordinary domination where a graph G ...
متن کاملHamiltonicity in 3-domination-critical graphs with
Let 6. y, and x be respectively the minimum degree, the domination number and the independence number of a graph G. The graph G is 3-y-critical if y= 3 and the addition of any edge decreases y by 1. It was conjectured that any connected 3-;l-critical graph with 6 >2 is hamiltonian. In Fararon et al. (J. Graph Theory, 25 (1997) 173-184.) it was proved a,<6 + 2; and moreover, if x < 6 + 1, then G...
متن کاملDomination game critical graphs
17 The domination game is played on a graph G by two players who alternately take 18 turns by choosing a vertex such that in each turn at least one previously undominated 19 vertex is dominated. The game is over when each vertex becomes dominated. One 20 of the players, namely Dominator, wants to finish the game as soon as possible, while 21 the other one wants to delay the end. The number of t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1999
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(99)00038-2